Survey-ACO in Task Scheduling problem

نویسنده

  • R. Sridaran
چکیده

Survey-ACO in Task Scheduling problem Vinothina V Department of Computer Science, Garden City College, Bangalore-39 Email: [email protected] Dr.R.Sridaran Faculty of Computer Applications, Marwadi Education Foundation’s Group of Institutions, Rajkot, Gujarat, India. Email: [email protected] ----------------------------------------------------------------------ABSTRACT------------------------------------------------------------Ant Colony Optimization (ACO) algorithms are probabilistic model inspired by the social behaviour of ants. Initially ACO is applied for travelling salesman problem. Later it is used for vector routing problem, scheduling problem, assignment problem, set problem, image processing, data mining, distributed information retrieval and others. By looking at the strength of ACO, they are the most appropriate for scheduling tasks. In this paper, we discussed the application of ACO in scheduling problem under different circumstances.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Task Scheduling in Fog Computing: A Survey

Recently, fog computing has been introducedto solve the challenges of cloud computing regarding Internet objects. One of the challenges in the field of fog computing is the scheduling of tasks requested by Internet objects. In this study, a review of articles related to task scheduling in fog computing has been done. At first, the research questions and goals will be introduced, an...

متن کامل

A Hybrid Heuristic Scheduling Algorithm in Cloud Computing

In cloud computing tasks scheduling problem is NP-hard, furthermore it does onerous for attaining an optimum resolution. Extremely quick optimization algorithms are used to proximate the optimum resolution, like ACO (ant colony optimization) algorithm. In cloud computing, in consideration to solve the problem of task scheduling, a period ACO (PACO)-based arranging algorithmic rule has been used...

متن کامل

An Adaptive Real Time Task Scheduler

Time constraint is the main factor in real time operating system. Different scheduling algorithm is used to schedule the task. The Earliest Deadline First and Ant Colony Optimization is a dynamic scheduling algorithm used in a real time system and it is most beneficial scheduling algorithm for single processor real-time operating systems when the systems are preemptive and under loaded. The mai...

متن کامل

A Priority-driven ACO Algorithm for DAG Task Scheduling in Cloud Environment

Task scheduling in cloud environment is a key technical problem on how to allocate available cloud resources to cloud users. Usually, a task in cloud environment can be cut into a serials of subtasks, which have precedence and dependency relationships among themselves. We describe the problem by means of a DAG (Directed Acyclic Graph) model. Then, we propose a priority algorithm for DAG task sc...

متن کامل

Study of Project Scheduling and Resource Allocation Using Ant Colony Optimization

Task Scheduling and Resource Allocation is an important phase in Project Management. Scheduling Problem in Software Projects is NP-complete and various algorithmic approaches have been studied to develop an optimal solution to generate a schedule, which will be cost effective, utilize resources effectively and meet the target deadline. This paper addresses the above problem in detail and review...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014